#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define rep(i, a, b) for (int i = (a); i <= (b); i++)
#define per(i, a, b) for (int i = (a); i >= (b); i--)
#define endl '\n'
const int N = 2e5 + 5;

mt19937 mt(chrono::steady_clock::now().time_since_epoch().count());
int n, m;
int a[N];
void solve() {
  cin >> n;
  rep(i, 1, n) cin >> a[i];
  int neg = 0, zero = 0;
  rep(i, 1, n) {
    if (a[i] < 0) neg ^= 1;
    if (a[i] == 0) zero++;
  }
  int ans = neg * 2 + zero;
  cout << ans << endl;
}
int main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  int t;
  cin >> t;
  while (t--) solve();
  return 0;
}